翻訳と辞書 Words near each other ・ Lattice Group ・ Lattice group ・ Lattice light-sheet microscopy ・ Lattice mast ・ Lattice Miner ・ Lattice model ・ Lattice model (biophysics) ・ Lattice model (finance) ・ Lattice model (physics) ・ Lattice multiplication ・ Lattice networks ・ Lattice of subgroups ・ Lattice path ・ Lattice phase equaliser ・ Lattice plane ・ Lattice problem ・ Lattice protein ・ Lattice QCD ・ Lattice reduction ・ Lattice scattering ・ Lattice Semiconductor ・ Lattice sieving ・ Lattice stool ・ Lattice tower ・ Lattice truss bridge ・ Lattice word ・ Lattice-based access control ・ Lattice-based cryptography ・ Lattice-tailed trogon ・ Latticed butterflyfish Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Lattice problem ： ウィキペディア英語版 Lattice problem In computer science, lattice problems are a class of optimization problems on lattices. The conjectured intractability of such problems is central to construction of secure lattice-based cryptosystems. For applications in such cryptosystems, lattices over vector spaces (often $\backslash mathbb^n$) or free modules (often $\backslash mathbb^n$) are generally considered. For all the problems below, assume that we are given (in addition to other more specific inputs) a basis for the vector space ''V'' and a norm ''N''. The norms usually considered are ''L''2. However, other norms (such as ''L''p) are also considered and show up in a variety of results. Let $\backslash lambda(L)$ denote the length of the shortest non-zero vector in the lattice ''L'', that is, : $\backslash lambda(L)\; =\; \backslash min\_\}\; \backslash |v\backslash |\_N$. ==Shortest vector problem (SVP)== In SVP, a basis of a vector space ''V'' and a norm ''N'' (often ''L''2) are given for a lattice ''L'' and one must find the shortest non-zero vector in ''V'', as measured by ''N'', in ''L''. In other words, the algorithm should output a non-zero vector ''v'' such that $N(v)=\backslash lambda(L)$. In the $\backslash gamma$-approximation version $SVP\_\backslash gamma$, one must find a non-zero lattice vector of length at most $\backslash gamma\; \backslash lambda(L)$. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Lattice problem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.